Useless Code Elimination and Programm Slicing for the Pi-Calculus
نویسنده
چکیده
In this paper, we study program transformations called uselesscode elimination and program slicing in the context of the π-calculus. The aim of useless-code elimination and program slicing is to simplify a program by eliminating useless or unimportant part of the program. We define formal correctness criteria for those transformations, present a type-based transformation method, and prove its correctness.
منابع مشابه
Useless-Code Elimination and Program Slicing for the Pi-Calculus
In this paper, we study program transformations called uselesscode elimination and program slicing in the context of the π-calculus. The aim of useless-code elimination and program slicing is to simplify a program by eliminating useless or unimportant part of the program. We define formal correctness criteria for those transformations, present a type-based transformation method, and prove its c...
متن کاملSort Abstraction for Static Analyses of Mobile Processes
The non-interference type based analysis and its closely related analyses (dead code elimination, program slicing, confidentiality, strictness, etc.) have been throughly studied in many programming paradigms. The work on this area has been initiated with functional programming, see e.g. [HR98, Pro00, ABHR99], as well as imperative programming, e.g. [SV98]. Following this idea, similar approache...
متن کاملAutomatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and complete way, by reducing it to the solution of a system of constraints. We also give a useless-code elimination algorithm which is based on a combined use of these type inference systems. The main application of the techni...
متن کاملInterprocedural Static Slicing of Binary Executables
Although the slicing of programs written in a high-level language has been widely studied in the literature, very little work has been published on the slicing of binary executable programs. The lack of existing solutions is really hard to understand since the application domain for slicing binaries is similar to that for slicing high-level languages. In this paper we present a method for the i...
متن کاملSlicing nichtterminierender Programme
Wir stellen einen Slicing-basierten Ansatz zur Terminationsanalyse von Logikprogrammen vor. Um die Terminationseigenschaften eines Programms zu erklären, werden ausführbare Programmfragmente (failure-slices) bestimmt. Falls eines dieser Programmfragmente nicht terminiert, so terminiert auch das gesamte Programm nicht. Der für die Nichttermination verantwortliche Teil des Programms kann so meist...
متن کامل